unlabeled node

См. также в других словарях:

• Coxeter–Dynkin diagram — See also: Dynkin diagram Coxeter Dynkin diagrams for the fundamental finite Coxeter groups …   Wikipedia

• Phylogenetic tree — ptree redirects here. For Patricia tree, see Radix tree …   Wikipedia

• Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… …   Wikipedia

• Dijkstra's algorithm — Not to be confused with Dykstra s projection algorithm. Dijkstra s algorithm Dijkstra s algorithm runtime Class Search algorithm Data structure Graph Worst case performance …   Wikipedia

• Nervous system — Nerve redirects here. For other uses, see Nerve (disambiguation). This article is about the nervous system. For parts of the nervous system commonly called nerves, see Peripheral nerve. Nervous system The Human N …   Wikipedia

• Tree (graph theory) — Trees A labeled tree with 6 vertices and 5 edges Vertices v Edges v 1 Chromatic number …   Wikipedia

• Vertex (graph theory) — For other uses, see Vertex (disambiguation). A graph with 6 vertices and 7 edges where the vertex number 6 on the far left is a leaf vertex or a pendant vertex In graph theory, a vertex (plural vertices) or node is the fundamental unit out of… …   Wikipedia

• test — 1. To prove; to try a substance; to determine the chemical nature of a substance by means of reagents. 2. A method of examination, as to determine the presence or absence of a definite disease or of some substance in any of the fluids, tissues,… …   Medical dictionary

• Random forest — In machine learning, a random forest is a classifier that consists of many decision trees and outputs the class that is the mode of the classes output by individual trees. The algorithm for inducing a random forest was developed by Leo Breiman… …   Wikipedia

• Polytree — A simple polytree In graph theory, a polytree is a directed graph with at most one undirected path between any two vertices. In other words, a polytree is a directed acyclic graph (DAG) for which there are no undirected cycles either.… …   Wikipedia

• Coxeter-Dynkin diagram — In geometry, a Coxeter Dynkin diagram is a graph with labelled edges. It represents the spatial relations between a collection of mirrors (or reflecting hyperplanes), and describes a kaleidoscopic construction.The diagram represents a Coxeter… …   Wikipedia